A real-time traffic simulation using a communication latency hiding parallelization

نویسندگان

  • Anthony T. Chronopoulos
  • Charles Michael Johnston
چکیده

This paper implements and analyzes a highway traffic-flow simulation based on continuum modeling of traffic dynamics. A traffic-flow simulation was developed and mapped onto a parallel computer architecture. Two algorithms (the one-step and two-step algorithms) to solve the simulation equations were developed and implemented. Tests with real traffic data collected from the freeway network in the metropolitan area of Minneapolis, MN, were used to validate the accuracy and computation rate of the parallel simulation system (with 256 processors). The execution time for a 24-h traffic-flow simulation over a 15.5-mi freeway, which takes 65.7 min on a typical single-processor computer, took only 88.51 s on the nCUBE2 and only 2.39 s on the CRAY T3E. The two-step algorithm, whose goal is to trade off extra computation for fewer interprocessor communications, was shown to save significantly on the communication time on both parallel computers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Communication Latency Hiding Parallelization of a Traffic Flow Simulation

This work implements and analyses a highway traffic flow simulation based on continuum modeling of traffic dynamics. A traffic-flow simulation was developed and mapped onto a parallel computer architecture. Two algorithms (the 1-step and 2-step algorithms) to solve the simulation equations were developed and implemented. They were then tested on an nCUBE2, a 1024 node hypercube with very slow i...

متن کامل

Predictive Control of Opto-Electronic Reconfigurable Interconnection Networks Using Neural Networks

Opto-electronic reconfigurable interconnection networks are limited by significant control latency when used in large multiprocessor systems. This latency is the time required to analyze the current traffic and reconfigure the network to establish the required paths. The goal of latency hiding is to minimize the effect of this control overhead. In this paper, we introduce a technique that perfo...

متن کامل

Schedulability Analysis for Real Time On-Chip Communication with Wormhole Switching

In this paper, the authors discuss a real-time on-chip communication service with a priority-based wormhole switching policy. The authors present a novel off-line schedulability analysis approach, worst case network latency analysis. By evaluating diverse inter-relationships and service attributes among the traffic flows, this approach can predict the packet network latency for all practical si...

متن کامل

An Approach to Parallelization of SIFT Algorithm on GPUs for Real-Time Applications

Scale Invariant Feature Transform (SIFT) algorithm is a widely used computer vision algorithm that detects and extracts local feature descriptors from images. SIFT is computationally intensive, making it infeasible for single threaded implementation to extract local feature descriptors for high-resolution images in real time. In this paper, an approach to parallelization of the SIFT algorithm i...

متن کامل

ارزیابی سیاست‌های زمان‌بندی در نسل چهارم شبکه‌های سلولی (LTE)

New generation of wireless networks, LTE and WiMAX, supports many services which consume a lot of resources (such as VOIP, Video Conference, Digital Video, Multimedia streams and online Multi-player Games). Supporting multi-media services in wireless communication systems provide new resource allocation challenges. Because of high loads in downlink, efficient resource allocation is vital in dow...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Vehicular Technology

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2002